A Note on the L1 Consistency of Variable Kernel Estimates
نویسندگان
چکیده
1 . Introduction . Most consistent nonparametric density estimates have a built-in smoothing parameter . Numerous schemes have been proposed (see, e.g ., references found in Rudemo, 1982 ; or Devroye and Penrod, 1984) for selecting the smoothing parameter as a function of the data only (a process called automatization), and for introducing locally adaptable smoothing parameters . In this note, we give conditions which insure that estimators of the form
منابع مشابه
Variable Kernel Estimates: on the Impossibility of Tuning the Parameters
For the standard kernel density estimate, it is known that one can tune the bandwidth such that the expected L1 error is within a constant factor of the optimal L1 error (obtained when one is allowed to choose the bandwidth with knowledge of the density). In this paper, we pose the same problem for variable bandwidth kernel estimates where the bandwidths are allowed to depend upon the location....
متن کاملStrong Universal Consistency of Smooth Kernel Regression Estimates
The paper deals with kernel estimates of Nadaraya-Watson type for a regression function with square integrable response variable. For usual bandwidth sequences and smooth nonnegative kernels, e.g., Gaussian and quartic kernels, strong L2-consistency is shown without any further condition on the underlying distribution. The proof uses a Tauberian theorem for Ces~ro summability. Let X be a d-dime...
متن کاملInequalities for a New Data-based Method for Selecting Nonparametric Density Estimates
We continue the development of a method for the selection of a bandwidth or a number of design parameters in density estimation. We provide explicit non-asymptotic density-free inequalities that relate the L1 error of the selected estimate with that of the best possible estimate, and study in particular the connection between the richness of the class of density estimates and the performance bo...
متن کاملNew Multivariate Product Density Estimators
where X(k) = (X(k)1, . . . , X(k)d), and X(k) is the k-th nearest neighbor of x when points are ordered by increasing values of the product ∏d j=1 |xj−X(k)j |, and k = o(log n), k → ∞. The auxiliary results needed permit us to formulate universal consistency results (pointwise and in L1) for product kernel estimates with different window widths for each coordinate, and for rectangular partition...
متن کاملA Note on Solving Prandtl's Integro-Differential Equation
A simple method for solving Prandtl's integro-differential equation is proposed based on a new reproducing kernel space. Using a transformation and modifying the traditional reproducing kernel method, the singular term is removed and the analytical representation of the exact solution is obtained in the form of series in the new reproducing kernel space. Compared with known investigations, its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985